CS 157 : Assignment 6 Douglas R . Lanman 8 May 2006 Problem 1 : Evaluating Convex Polygons
نویسنده
چکیده
Problem 1: Evaluating Convex Polygons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a convex polygon (i.e., a convex hull). In Section 1.1, we introduce the notion of regular polygons and provide examples of both convex and non-convex point sets. Section 1.2 presents an algorithm for ordering a set of points such that a counterclockwise traversal defines the interior of the convex hull. In Section 1.3, we apply this method to determine whether a given set of points are the vertices of a convex hull. Finally, in Section 1.4, we derive a lower bound for the worst-case running time of all such vetex-ordering algorithms.
منابع مشابه
CS 157 : Assignment 4 Douglas
This write-up presents the design and analysis of several algorithms for determining the maximum sum of certain subsets of one-dimensional arrays. In the first section, we consider the Maximum Subsequence Sum (MSS) problem: given an array A with signed integer elements, find a contiguous subarray with the maximum possible sum. In Section 2, we extend our algorithm to handle the case of cyclic s...
متن کاملCS 195 - 5 : Machine Learning Problem Set 1
Show that the prediction errors y − f (x; ˆ w) are necessarily uncorrelated with any linear function of the training inputs. That is, show that for any a ∈ R d+1ˆσ(e, a T x) = 0, where e i = y i − ˆ w T x i is the prediction error for the i th training example.
متن کاملCS 157 : Assignment 3
In this write-up, we extend quicksort to the task of fuzzy sorting of intervals. In many situations the precise value of a quantity is uncertain (e.g., any physical measurement is subject to noise). For such situations we may represent a measurement i as a closed interval [ai, bi], where ai ≤ bi. A fuzzysort is defined as a permutation 〈i1, i2, . . . , in〉 of the intervals such that there exist...
متن کاملCS 195 - 5 : Machine Learning Problem Set 6
For this problem we assume that the set of training examples {(xi, yi)} are drawn from two classes such that yi = ±1. For such two-class classifcation problems, the form of yihm(xi) is particularly simple; if an example is correctly classified, then yihm(xi) = 1. If an example is misclassified, then yihm(xi) = −1. As a result, Equation 3 can be decomposed as Zm = W (m−1) + e −αm + W (m−1) − e α...
متن کاملCS 157 : Assignment 2 Douglas R . Lanman
The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is one of the most efficient disjoint-set data structures known [1]. In general, union-find can be applied to any problem in which one must determine membership within a set. For instance, in class we studied its application within Kruskal’s algorithm, where it was used to efficiently detect connecte...
متن کامل